例句與造句

1. NVIDIA has also introduced new polygon edge HDR rendering, an increase from prior cards'64-bit support.
2. The level of anti-aliasing determines how smooth polygon edges are ( and how much video memory it consumes ).
3. In computer graphics, anti-aliasing improves the appearance of polygon edges, so they are not " jagged " but are smoothed out on the screen.
4. If the polygon is in general position ( i . e . no two edges are collinear ), then every triangle can cover at most 3 polygon edges.
5. The expression thus derived from a fundamental polygon of a surface turns out to be the sole relation in a presentation of the fundamental group of the surface with the polygon edge labels as generators.
6. It's difficult to find polygon edge in a sentence. 用polygon edge造句挺難的
7. The Vatti algorithm involves processing both subject and clipping polygon edges in an orderly fashion, starting with the lowermost edges and working towards the top; this is conceptually similar to the Bentley Ottmann algorithm.
8. The C 70 molecule has a D 5h symmetry and contains 37 faces ( 25 hexagons and 12 pentagons ) with a carbon atom at the vertices of each polygon and a bond along each polygon edge.
9. It is a cage-like fused-ring structure which resembles a rugby ball, made of 25 hexagons and 12 pentagons, with a carbon atom at the vertices of each polygon and a bond along each polygon edge.
10. The structure of C 60 is a truncated icosahedron, which resembles an association football ball of the type made of twenty hexagons and twelve pentagons, with a carbon atom at the vertices of each polygon and a bond along each polygon edge.
11. In some scenarios, it is not required to cover the entire polygon but only its edges ( this is called " polygon edge covering " ) or its vertices ( this is called " polygon vertex covering " ).
12. It has a cage-like fused-ring structure ( truncated icosahedron ) which resembles a football ( soccer ball ), made of twenty hexagons and twelve pentagons, with a carbon atom at each vertex of each polygon and a bond along each polygon edge.
13. For instance, the planar graph duality : a triangulation can be transformed bijectively into a tree with a leaf for each polygon edge, an internal node for each triangle, and an edge for each two polygon edges or triangles that are adjacent to each other.
14. For instance, the planar graph duality : a triangulation can be transformed bijectively into a tree with a leaf for each polygon edge, an internal node for each triangle, and an edge for each two polygon edges or triangles that are adjacent to each other.